Quantum Recommendation Systems

نویسندگان

  • Iordanis Kerenidis
  • Anupam Prakash
چکیده

A recommendation system uses the past purchases or ratings of n products by a group of m users, in order to provide personalised recommendations to individual users. The information is modelled as an m×n preference matrix which is assumed to have a good k-rank approximation, for a small constant k. In this work, we present a quantum algorithm for recommendation systems that has running time O(poly(k)polylog(mn)). All classical algorithms for recommendation systems that work through reconstructing an approximation of the preference matrix run in time polynomial in the matrix dimension. Our algorithm provides good recommendations by sampling efficiently from an approximation of the preference matrix, without reconstructing the entire matrix. For this, we design an efficient quantum procedure to project a given vector onto the row space of a given matrix. This is the first algorithm for recommendation systems that runs in time polylogarithmic in the dimensions of the matrix and provides a real world application of quantum algorithms in machine learning. ∗CNRS, IRIF, Université Paris Diderot, Paris, France and Centre for Quantum Technologies, National University of Singapore, Singapore. Email: [email protected]. †Centre for Quantum Technologies and School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore. Email: [email protected].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamic Grover Search: Applications in Recommendation systems and Optimization problems

In the recent years we have seen that Grover search algorithm [1] by using quantum parallelism has revolutionized the field of solving huge class of NP problems in comparison to classical systems. In this work we explore the idea of extending the Grover search algorithm to approximate algorithms. Here we try to analyze the applicability of Grover search to process an unstructured database with ...

متن کامل

Recommender systems inspired by the structure of quantum theory

Physicists use quantum models to describe the behavior of physical systems. Quantum models owe their success to their interpretability, to their relation to probabilistic models (quantization of classical models) and to their high predictive power. Beyond physics, these properties are valuable in general data science. This motivates the use of quantum models to analyze general nonphysical datas...

متن کامل

Designing a quantum genetic controller for tracking the path of quantum systems

Based on learning control methods and computational intelligence, control of quantum systems is an attractive field of study in control engineering. What is important is to establish control approach ensuring that the control process converges to achieve a given control objective and at the same time it is simple and clear. In this paper, a learning control method based on genetic quantum contr...

متن کامل

Optimizing Teleportation Cost in Multi-Partition Distributed Quantum Circuits

There are many obstacles in quantum circuits implementation with large scales, so distributed quantum systems are appropriate solution for these quantum circuits. Therefore, reducing the number of quantum teleportation leads to improve the cost of implementing a quantum circuit. The minimum number of teleportations can be considered as a measure of the efficiency of distributed quantum systems....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017